Research Announcement: a Computer-generated Proof That P=np
نویسنده
چکیده
Doron ZEILBERGER Abstract: Using 3000 hours of CPU time on a CRAY machine, we settle the notorious P vs. NP problem in the affirmative, by presenting a “polynomial” time algorithm for the NP-complete subset sum problem. Alas the complexity of our algorithm is O(n 10000 ) (with the implied constant being larger than the Skewes number). This anticlimatic resolution of the “central” problem in theoretical computer science indicates the fatal flaw of the ruling paradigm in computational complexity theory that equates “polynomial time” with “fast”, and presents yet another cautionary tale about the human propensity to trust artificial and crude models blindly, as witnessed in the recent collapse of Wall Street.
منابع مشابه
A Proof for P =? NP Problem
The P =? NP problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for P =? NP problem. The central idea of this proof is a recursive definition for Turing machine (shortly TM) that accepts the encoding strings of valid TMs. By the definition, an infinite sequence of TM i...
متن کاملExploring k-Colorability
The P vs NP problem is now well-known worldwide, even beyond academia, due to the publicity generated by the Clay Mathematics Institute, which bestowed upon it one of seven Millennium Prizes on a correct proof of the solution. The concept of NP-completeness was first formulated by Stephen Cook, in application to the boolean satisfiability problem [Coo71]. Later, Richard Karp took 20 additional ...
متن کاملFormalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
Since the proof of the four color theorem in 1976, computergenerated proofs have become a reality in mathematics and computer science. During the last decade, we have seen formal proofs using verified proof assistants being used to verify the validity of such proofs. In this paper, we describe a formalized theory of size-optimal sorting networks. From this formalization we extract a certified c...
متن کاملUniformly Generated Submodules of Permutation Modules
This paper is motivated by a link between algebraic proof complexity and the representation theory of the finite symmetric groups. Our perspective leads to a series of non-traditional problems in the representation theory of Sn. Most of our technical results concern the structure of “uniformly” generated submodules of permutation modules. We consider (for example) sequences Wn of submodules of ...
متن کاملEfficient Batch Verification for UP
Consider a setting in which a prover wants to convince a verifier of the correctness of k NP statements. For example, the prover wants to convince the verifier that k given integers N1, . . . , Nk are all RSA moduli (i.e., products of equal length primes). Clearly this problem can be solved by simply having the prover send the k NP witnesses, but this involves a lot of communication. Can intera...
متن کامل